The Tyft/Tyxt Format Reduces to Tree Rules
نویسنده
چکیده
REPORTRAPPORT The tyft/tyxt format reduces to tree rules Abstract. Groote and Vaandrager 5] introduced the tyft/tyxt format for transition system speciications (TSSs), and established that for each TSS in this format that is well-founded, the strong bisimulation it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an aarmative answer to an open question, namely whether the well-foundedness condition in the Congruence Theorem of 5] can be dropped. These results extend to tyft/tyxt with negative premises and predicates.
منابع مشابه
Ntyft/Ntyxt Rules Reduce to Ntree Rules
Groote and Vaandrager introduced the tyft/tyxt format for Transition System Speci cations (TSSs), and established that for each TSS in this format that is well-founded, the bisimulation equivalence it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an a rmative answer to an open ...
متن کاملStructured Operational Semantics and Bisimulation as a Congruence
In this paper the question is considered in which cases a transition system specification in Plotkin style has 'good' properties and deserves the predicate 'structured'. The discussion takes place in a setting of labelled transition systems. The states of the transition systems are terms generated by a single sorted signature and the transitions between states are defined by conditional rules. ...
متن کاملA Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
In this paper we describe the promoted tyft/tyxt rule format for deening higher-order languages. The rule format is a generalization of Groote and Vaan-drager's tyft/tyxt format in which terms are allowed as labels on transitions in rules. We prove that bisim-ulation is a congruence for any language deened in promoted tyft/tyxt format and demonstrate the usefulness of the rule format by present...
متن کاملSOS for Higher Order Processes
We lay the foundations for a Structural Operational Semantics (SOS) framework for higher order processes. Then, we propose a number of extensions to Bernstein’s promoted tyft/tyxt format which aims at proving congruence of strong bisimilarity for higher order processes. The extended format is called promoted PANTH. This format is easier to apply and strictly more expressive than the promoted ty...
متن کاملA format for semantic equivalence comparison
This paper presents a new format for process algebras, the extended tyft/tyxt format which generalises the tyft/tyxt format of Groote and Vaandrager. The format differs from most previous formats in that the labels on transitions are treated as manysorted terms. Bisimulation is a congruence for all operators defined by extended transition system specifications in this format. When one extended ...
متن کامل